Natural Deduction Environment for Matita
نویسندگان
چکیده
Matita is a proof assistant characterised by a rich, user extensible, output facility based on a widget for the rendering of MathML Presentation, and by the automatic handling of overloading by means of a flexible disambiguation mechanism. We show how to use these features to obtain a simple learning environment for natural deduction, without modifying the source code or Matita.
منابع مشابه
Development of a proof assistant for Dedukti
Dedukti [11] is a formal proof checker based on a logical framework called the λΠ-calculus modulo, which is an extension of the simply-typed lambdacalculus with dependent types (e.g. lists of size n) and an equivalence relation on types generated by user-defined rewrite rules (like in Agda or Haskell). Proofs obtained by some proof assistants (e.g. HOL, Coq, Matita) can be checked in Dedukti by...
متن کاملMatita Tutorial
0 Getting Started 94 0.1 Installing Matita . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 94 0.2 Preparing a working directory . . . . . . . . . . . . . . . . . . . . . . 95 0.3 Matita interface . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95 0.4 Browsing the library . . . . . . . . . . . . . . . . . . . . . . . . . . . 96 0.5 Live DVD . . . . . . . . . . . . . . . . ....
متن کاملA Proof Environment for the Development of Group Communication Systems
C. & H. Kirchner, ed. 15 International Conference on Automated Deduction (CADE-15), LNAI 1421, pp. 317–331, c ©Springer Verlag, 1998. Abstract. We present a theorem proving environment for the development of reliable and efficient group communication systems. Our approach makes methods of automated deduction applicable to the implementation of real-world systems by linking the Ensemble group co...
متن کاملFormalising Overlap Algebras in Matita
We describe some formal topological results, formalized in Matita 1/2, presented in predicative intuitionistic logic and in terms of Overlap Algebras. Overlap Algebras are new algebraic structures designed to ease reasoning about subsets in an algebraic way within intuitionistic logic. We find that they also ease the formalization of formal topological results in an interactive theorem prover. ...
متن کاملAbout the Formalization of Some Results by Chebyshev in Number Theory
We discuss the formalization, in the Matita Interactive Theorem Prover, of a famous result by Chebyshev concerning the distribution of prime numbers, essentially subsuming, as a corollary, Bertrand’s postulate. Even if Chebyshev’s result has been later superseded by the stronger prime number theorem, his machinery, and in particular the two functions ψ and θ still play a central role in the mod...
متن کامل